Lossy Dictionaries

Lossy Dictionaries

Lossy Dictionaries

Bloom ltering is an important technique for space e cient storage of a conservative approximation of a set S. The set stored may have up to some speci ed number of false positive members, but all elements of S are included. In this paper we consider lossy dictionaries that are also allowed to have false negatives , i.e., leave out elements of S. The aim is to maximize the weight of included key...

Building Lossy Trapdoor Functions from Lossy Encryption

Injective one-way trapdoor functions are one of the most fundamental cryptographic primitives. In this work we show how to derandomize lossy encryption (with long messages) to obtain lossy trapdoor functions, and hence injective one-way trapdoor functions. Bellare, Halevi, Sahai and Vadhan (CRYPTO ’98) showed that if Enc is an IND-CPA secure cryptosystem, and H is a random oracle, then x 7→ Enc...

Dictionaries Revisited

Dictionaries are probably the most well studied class of data structures. A dictionary supports insertions, deletions, membership queries, and usually successor, predecessor, and extract-min. Given their centrality to both the theory and practice of data structures, surprisingly basic questions about them remain unsolved and sometimes even unposed. This talk focuses on questions that arise from...

Deterministic Dictionaries

It is shown that a static dictionary that offers constant-time access to n elements with w-bit keys and occupies O(n) words of memory can be constructed deterministically in O(n log n) time on a unit-cost RAM with word length w and a standard instruction set including multiplication. Whereas a randomized construction working in linear expected time was known, the running time of the best previo...